Gödel : an Interactive Incremental Logic Programming Environment

نویسندگان

  • Daniel Lanovaz
  • Duane Szafron
چکیده

SUMMARY This paper describes Gödel, an interactive incremental logic programming environment. Gödel supports programming in "standard" Prolog. However, Gödel uses its environment to superimpose a module structure and an inheritance typing system which can be used to support modern software engineering strategies. In addition, Gödel presents the user with a uniform user interface for browsing, editing, executing and debugging which simplifies context switches between these activities and reports errors as they occur. The most important and novel aspects of Gödel are its introduction of software engineering support without changing the language, its incremental translation of clauses to a persistent clause base as the clauses are entered, its efficient object-oriented inference engine written in Smalltalk-80 and its primitive clauses that provide a seamless interface between Prolog and Smalltalk-80.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Free Algebras for Gödel-Löb Provability Logic

We give a construction of finitely generated free algebras for Gödel-Löb provability logic, GL. On the semantic side, this construction yields a notion of canonical graded model for GL and a syntactic definition of those normal forms which are consistent with GL. Our two main techniques are incremental constructions of free algebras and finite duality for partial modal algebras. In order to app...

متن کامل

An object-oriented inference engine for PROLOG

This article describes an object-oriented inference engine for PROLOG. The inference engine is part of the Graphically Oriented Development Environment for Logic (Gödel) programming. Gödel incrementally translates source clauses to a persistent clause base in which each clause is an object. The inference engine is a distributed one in which each clause object knows how to unify and execute itse...

متن کامل

An execution scheme for interactive problem-solving in concurrent constraint logic programming languages

Van Emden’s incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the context of constraint logic programming, incremental queries involve adding new constraints or deleting old ones from a query after a solution is found. This paper presents an implementation scheme IQ of incremental queries i...

متن کامل

A Logic of Interactive Proofs (Formal Theory of Knowledge Transfer)

We propose a logic of interactive proofs as a framework for an intuitionistic foundation for interactive computation, which we construct via an interactive analog of the Gödel-McKinsey-Tarski-Artëmov definition of Intuitionistic Logic as embedded into a classical modal logic of proofs, and of the Curry-Howard isomorphism between intuitionistic proofs and typed programs. Our interactive proofs e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990